Neighbor discovery in wireless networks with sectored antennas

نویسندگان

  • Robert Murawski
  • Emad A. Felemban
  • Eylem Ekici
  • Sangjoon Park
  • S. Yoo
  • Kangwoo Lee
  • Juderk Park
  • Zeeshan Hameed Mir
چکیده

Directional antennas offer many potential advantages for wireless networks such as increased network capacity, extended transmission range and reduced energy consumption. Exploiting these advantages requires new protocols and mechanisms at various communication layers to intelligently control the directional antenna system. With directional antennas, many trivial mechanisms, such as neighbor discovery, become challenging since communicating parties must agree on where and when to point their directional beams to communicate. In this paper, we propose a fully directional neighbor discovery protocol called SectoredAntenna Neighbor Discovery (SAND) protocol. SAND is designed for sectored-antennas, a low-cost and simple realization of directional antennas, that utilize multiple limited beamwidth antennas. Unlike many proposed directional neighbor discovery protocols, SAND depends neither on omnidirectional antennas nor on time synchronization. SAND performs neighbor discovery in a serialized fashion allowing individual nodes to discover all potential neighbors within a predetermined time. SAND guarantees the discovery of the best sector combination at both ends of a link, resulting in more robust and higher quality links between nodes. Finally, SAND reliably gathers the neighborhood information in a centralized location, if needed, to be used by centralized networking protocols. The effectiveness of SAND has been assessed via simulation studies and real hardware implementation. 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Location-aware Routing Scheme for Wireless Mesh Networks using Directional Antennas

This paper addresses the problem of neighbor discovery and route computation in wireless mesh networks where the wireless routers are equipped with directional antennas. Here we take advantage of the directional antennas capabilities to estimate the position of nearby nodes located in the first-hop neighborhood. The algorithm developed spreads the node's position information through the network...

متن کامل

Energy Efficient Broadcast with Sectored Antennas in Wireless Ad Hoc Networks

In this paper we address the problem of energy-efficient broadcast in wireless ad hoc networks. We first extend the broadcast incremental power algorithm (BIP) [4] – an efficient algorithm to construct broadcast trees – to support sectored antennas. Secondly, we simulate and extensively compare the original BIP algorithm with the extended and modified BIP. The simulation shows drastic reduction...

متن کامل

Variable Sectored Antenna Medium Access Control (V-SAMAC) Protocol for Wireless Sensor Networks

Wireless sensor networks have been used to gather data and information in different field applications. Different fields have different needs and requirements like some need high data rates, some need high throughput and some need less delays etc. In order to address these QoS requirements, we have used sectored antennas over the Omni-directional antennas. The most important benefits of using s...

متن کامل

Evaluation of a BIBD Based Directional MAC Protocol for Wireless Ad Hoc Networks

The use of directional antennas in wireless ad hoc networks can significantly improve global performance due to a high spatial channel reuse. Nevertheless, its introduction poses new location dependent problems related to the MAC protocol. In this paper, the Balanced Incomplete Block Design theory has been exploited to develop a new MAC protocol for wireless ad hoc networks using directional ant...

متن کامل

On K-node Survivable Power Efficient Topologies in Wireless Networks with Sectored Antennas

We consider the problem of survivable minimum power bidirectional topology optimization in wireless networks with sectored antennas. In this paper, we take an algebraic view of graph connectivity, which is defined as the second smallest eigenvalue of the laplacian matrix of a graph. We propose a (sub-optimal) centralized heuristic procedure for constructing power efficient K-node connected topo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ad Hoc Networks

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2012